A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardinessobjective.

The Comparison of the Relative Entropy for Intrusion Detection on CPU and GPU.

Privacy preserving group nearest neighbor queries.

An efficient color image classification method using gradient magnitude based angle cooccurrence matrix.

Integrating visual saliency and consistency for re%2Dranking image search results.

Application of artificial neural network to failure diagnosis on process industry equipments.

Chaos Immune Algorithm and its application to function optimization.

PID Control Analysis of Brake Test Bench.

Verifiable Fine%2DGrained Top%2Dk Queries in Tiered Sensor Networks.

Wormhole%2DResilient Secure Neighbor Discovery in Underwater Acoustic Networks.

Effective Quality of Service Differentiation for Real%2Dworld Storage Systems.

PriSense Privacy%2DPreserving Data Aggregation in People%2DCentric Urban Sensing Systems.

Effective Quality of Service Differentiation for Real%2Dworld Storage Systems.

Optimization on Motion Estimation and DSP Algorithm Based on AVS Encoding.

Cooperative Feedback in Multi%2DAntenna Cognitive Networks.

Author Name Disambiguation for Citations on the Deep Web.

Cooperative Interference Management in Multi%2DCell Downlink Beamforming.

Cooperative Multi%2DCell Block Diagonalization with Per%2DBase%2DStation Power Constraints.

Regional Logistics Demand Analysis Based on Gray System Theory A Case Study of Hangzhou City.

A hybrid approach to large%2Dscale job shop scheduling.

A hybrid immune simulated annealing algorithm for the job shop scheduling problem.

Dynamic Resource Allocation in Cognitive Radio Networks A Convex Optimization Perspective

On Design of Distributed Beamforming for Two%2DWay Relay Networks

Cooperative Feedback for MIMO Interference Channels

Cooperative Precoding with Limited Feedback for MIMO Interference Channels

On Design of Collaborative Beamforming for Two%2DWay Relay Networks

Optimal Distributed Beamforming for MISO Interference Channels

An IBE scheme using ECC combined public key.

Approximations of the standard principal components analysis and kernel PCA.

IEEE 802.15.5 WPAN mesh standard%2Dlow rate part Meshing the wireless sensor networks.

Cooperative Multi%2DCell Block Diagonalization with Per%2DBase%2DStation Power Constraints.

Incremental Evaluation of Visible Nearest Neighbor Queries.

Multi%2Dantenna based spectrum sensing for cognitive radios A GLRT approach.

On Active Learning and Supervised Transmission of Spectrum Sharing Based Cognitive Radios by Exploiting Hidden Primary Radio Feedback.

Cognitive beamforming made practical Effective interference channel and learning%2Dthroughput tradeoff.

On the relationship between the multi%2Dantenna secrecy communications and cognitive radio communications.

Cooperative interference management with MISO beamforming.

Optimal power allocation for OFDM%2Dbased cognitive radio with new primary transmission protection criteria.

Dominating sets in directed graphs.

The QM%2DMM interface for CHARMM%2DdeMon.

The HV%2Dtree a Memory Hierarchy Aware Version Index.
The huge amount of temporal data generated from many important applications call for a highly efficient and scalable version index. The TSB-tree has the potential of large scalability due to its unique feature of progressive migration of data to larger mediums. However, its traditional design optimized for two levels of the memory hierarchy (the main memory and the hard disk) undermines its potential for high efficiency in face of today’s advances in hardware, especially CPU/cache speed and memory size. We propose a novel version index structure called the HV-tree. Different from all previous version index structures, the HV-tree has nodes of different sizes, each optimized for a level of the memory hierarchy. As data migrates to different levels of the memory hierarchy, the HV-tree will adjust the node size automatically to exploit the best performance of all levels of the memory hierarchy. Moreover, the HVtree has a unique chain mechanism to maximally keep recent data in higher levels of the memory hierarchy. As a result, HV-tree is several times faster than the TSB-tree for point queries (query with single key and single time value), and up to 1000 times faster than the TSB-tree for key-range and time-range queries.
Analysis and evaluation of V%2A%2DkNN an efficient algorithm for moving kNN queries.

A motion%2Daware approach for efficient evaluation of continuous queries on 3D object databases.

HPRP Hierarchical Probabilistic Routing Protocol for Wireless Mesh Network.

Dynamic output%2Dfeedback Hinfinity control for polytopic Delta operator systems.

Mesh Simplification with Global Contour Feature Preservation.

Using Description Logics in Relation Based Access Control.
Abstract. Relation Based Access Control (RelBAC) is an access control model designed for the new scenarios of access control on Web 2.0. Under this model, we discuss in this paper how to formalize with Description Logics the typical authorization problems of access control together with the enforcement of an important security property: Separation of Duties (SoD) and some high level security policies about the composition of those subjects on which to separate the duties. 1

Exploiting Opportunistic Multiuser Detection in Decentralized Multiuser MIMO Systems.


On Outage Capacity of Secondary Users in Fading Cognitive Radio Networks with Primary User%27s Outage Constraint.

Robust Beamforming Design From Cognitive Radio MISO Channels to Secrecy MISO Channels.

Delay%2DThroughput Tradeoff for Supportive Two%2DTier Networks A Static Primary Tier Vs. a Mobile Secondary Tier.

Power Allocation for OFDM%2DBased Cognitive Radio Systems with Hybrid Protection to Primary Users.

Research on the continuum%2Fdiscontinuum multiscale analytical system of the interaction between rigid wheel and lunar soil.

A collaborative Bayesian image retrieval framework.

Multi%2Dantenna cognitive radio systems Environmental learning and channel training.


On Capacity Region of Two%2DWay Multi%2DAntenna Relay Channel with Analogue Network Coding.


Optimal Power Allocation for Cognitive Radio Under Primary User%27s Outage Loss Constraint.

Optimal Transmission for Dying Channels.

Protecting Primary Users in Cognitive Radio Networks Peak or Average Interference Power Constraint%3F

V%2A%2DkNN An Efficient Algorithm for Moving k Nearest Neighbor Queries.

Numerical Simulation of Corrosion Fatigue Crack Propagation.

Fatigue Life Prediction of Served Aircraft Aluminum Alloy Structure.

Interpolating fine texturess with fields of experts prior.

Multimedia multimodal methodologies.

Image classification based on pyramid histogram of topics.

Learning super resolution with global and local constraints.

Multimodal image retrieval via bayesian information fusion.

Creative Design Framework Based on Immune Computing.

Feature Selection for Hyperspectral Data based on Modified Recursive Support Vector Machines.

DP2AC Distributed Privacy%2DPreserving Access Control in Sensor Networks.

Secure Range Queries in Tiered Sensor Networks.

Delay%2DDependent Exponential Stability of Discrete%2DTime BAM Neural Networks with Time Varying Delays.

Constructing Better KEMs with Partial Message Recovery.

Secure multidimensional range queries in sensor networks.

TwinRoute Energy%2DEfficient Data Collection in Fixed Sensor Networks with Mobile Sinks.

A New Approach to Salt%2Dand%2DPepper Noise Removal for Color Image.

Low%2Drate WPAN mesh network an enabling technology for ubiquitous networks.

Nonparametric Data Reduction Techniques.

Parametric Data Reduction Techniques.

Data Reduction.

Iterative Spectrum Shaping with Opportunistic Multiuser Detection

Design of Learning Based MIMO Cognitive Radio Systems

Outage Capacity and Optimal Transmission for Dying Channels

Throughput and Delay Scaling in Supportive Two%2DTier Networks

Exploiting Opportunistic Multiuser Detection in Decentralized Multiuser MIMO Systems

On Active Learning and Supervised Transmission of Spectrum Sharing Based Cognitive Radios by Exploiting Hidden Primary Radio Feedback

Cooperative Multi%2DCell Block Diagonalization with Per%2DBase%2DStation Power Constraints

Cooperative Interference Management in Multi%2DCell Downlink Beamforming

Cooperative Feedback for Multi%2DAntenna Cognitive Radio Networks

Optimal beamforming for two%2Dway multi%2Dantenna relay channel with analogue network coding.

On achievable rates of two%2Dpath successive relaying.

Optimal channel estimation and training design for two%2Dway relay networks.

On ergodic sum capacity of fading cognitive multiple%2Daccess and broadcast channels.

Channel estimation for OFDM modulated two%2Dway relay networks.

Joint Beamforming and Power Control for Multiantenna Relay Broadcast Channel With QoS Constraints.

Optimal power allocation for fading channels in cognitive radio networks Ergodic capacity and outage capacity.

Opportunistic spectrum access for energy%2Dconstrained cognitive radios.
This paper considers a scenario in which a secondary user makes opportunistic use of a channel allocated to some primary network. The primary network operates in a time-slotted manner and switches between idle and active states according to a stationary Markovian process. At the beginning of each time slot, the secondary user can choose to stay idle or to carry out spectrum sensing to detect if the primary network is idle or active. If the primary network is detected as idle, the secondary user can carry out data transmission. Spectrum sensing consumes time and energy and introduces false alarms and mis-detections. Given the delay cost associated with staying idle, the energy costs associated with spectrum sensing and data transmission, and the throughput gain associated with successful transmissions, the objective is to decide, for each time slot, whether the secondary user should stay idle or carry out sensing, and if so, for how long, to maximize the expected net reward. We formulate this problem as a partially observable Markov decision process (POMDP) and prove several structural properties of the optimal spectrum sensing/accessing policies. Based on these properties, heuristic control policies with low complexity and good performance are proposed. I.
On peak versus average interference power constraints for protecting primary users in cognitive radio networks.

Strong Anonymous Signature.

Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two%2Dlevel supply chains.

The AGA Evaluating Model of Customer Loyalty Based on E%2Dcommerce Environment.

Least Square Transduction Support Vector Machine.

Spatio%2Dtemporal database research at the University of Melbourne.

A Novel Security Protocol to Protect Mobile Agent against Colluded Truncation Attack by Cooperation.

Load Balancing for Moving Object Management in a P2P Network.
Abstract. Online games and location-based services now form the potential application domains for the P2P paradigm. In P2P systems, balancing the workload is essential for overall performance. However, existing load balancing techniques for P2P systems were designed for stationary data. They can produce undesirable workload allocations for moving objects that is continuously updated. In this paper, we propose a novel load balancing technique for moving object management using a P2P network. Our technique considers the mobility of moving objects and uses an accurate cost model to optimize the performance in the management network, in particular for handling location updates in tandem with query processing. In a comprehensive set of experiments, we show that our load balancing technique gives constantly better update and query performance results than existing load balancing techniques.
A Performance Management System for Telecommunication Network Using AI Techniques.

An Immune Genetic Algorithm Based on Bottleneck Jobs for the Job Shop Scheduling Problem.

Fuzzy AHP Evaluation on Road Transportation in Wuhan City Cluster.

On the Outage Capacity of a Dying Channel.

On Channel Estimation for Amplify%2Dand%2DForward Two%2DWay Relay Networks.

Optimal Resource Allocation for Two%2DWay Relay%2DAssisted OFDMA.

GLRT%2DBased Spectrum Sensing for Cognitive Radio.

Optimal Power Control over Fading Cognitive Radio Channel by Exploiting Primary User CSI.

Stability of Solutions of Discrete Reflected BSDEs.

Learning object classes from image thumbnails through deep neural networks.

Characterizing Achievable Rates for Two%2DPath Digital Relaying.

Testbed Experimentation of a Meshed Tree Routing with Local Link State for Wireless PAN Mesh.

Optimal Analogue Relaying with Multi%2DAntennas for Physical Layer Network coding.

Two%2DWay Relaying over OFDM Optimized Tone Permutation and Power Allocation.

Optimized Multi%2DAntenna Broadcasting for Heterogeneous Delay%2DConstrained Traffic.

A Motion%2DAware Approach to Continuous Retrieval of 3D Objects.

Design of DNA Sequence Based on Improved Genetic Algorithm.

Accurate parameter estimation and efficient fade detection for weighted prediction in H.264 video compression.

Face super%2Dresolution using 8%2Dconnected Markov Random Fields with embedded prior.

A New Method for Test Suite Reduction.

Decomposition and immune genetic algorithm for scheduling large job shops.

Array optimizations for parallel implementations of high productivity languages.

A Novel Free%2DRoaming Mobile Agent Security Protocol against Colluded Truncation Attack by ACK.

A new framework of relevance feedback for content%2Dfree image retrieval.

The Design of Autonomous Smart Car Used in Simulation of Vehicle Platoon.

A Collaborative Bayesian Image Annotation Framework.

Commit phase in timestamp%2Dbased stm.

Shanghai Jiao Tong University participation in high%2Dlevel feature extraction
In this paper, we describe our participation for high-level feature extraction, automatic search and surveillance event detection at TRECVID 2008 evaluation. In high-level feature extraction, we use selective attention model to extract visual salient feature which highlights the most visual attractive information of an image. Besides this, we extract 7 low-level features for various modalities as a baseline and use linear weighted fusion of multi-modalities. Results show that simple linear weighted fusion works pretty well. In addition, ASR is useful to improve the performance. We submitted the following six runs: • A SJTU 1: Max of all runs based on different methods, and Re-rank based on ASR • A SJTU 2: Max of all runs based on different methods • A SJTU 3: Linear weighted fusion across 7 modalities except Attention model, SVM train on TRECVID2008 development data • A SJTU 4: Attention model,SVM train on TRECVID2008 development data • B SJTU 5: SVM train on TRECVID2008 and TRECVID2005 development data based on feature replication • A SJTU 6: Local Binary Pattern,SVM train on TRECVID2008 development dataIn automatic search, we use text-based search as baseline, combined with concept-based search and query-byexample
Opportunistic Spectrum Access for Energy%2DConstrained Cognitive Radios.
This paper considers a scenario in which a secondary user makes opportunistic use of a channel allocated to some primary network. The primary network operates in a time-slotted manner and switches between idle and active states according to a stationary Markovian process. At the beginning of each time slot, the secondary user can choose to stay idle or to carry out spectrum sensing to detect if the primary network is idle or active. If the primary network is detected as idle, the secondary user can carry out data transmission. Spectrum sensing consumes time and energy and introduces false alarms and mis-detections. Given the delay cost associated with staying idle, the energy costs associated with spectrum sensing and data transmission, and the throughput gain associated with successful transmissions, the objective is to decide, for each time slot, whether the secondary user should stay idle or carry out sensing, and if so, for how long, to maximize the expected net reward. We formulate this problem as a partially observable Markov decision process (POMDP) and prove several structural properties of the optimal spectrum sensing/accessing policies. Based on these properties, heuristic control policies with low complexity and good performance are proposed. I.
Global existence and blow%2Dup solutions and blow%2Dup estimates for a non%2Dlocal quasilinear degenerate parabolic system.

Shape%2Dtopology optimization of stokes flow via variational level set method.

Optimal Power Control over Fading Cognitive Radio Channels by Exploiting Primary User CSI

On Multiuser Power Region of Fading Multiple%2DAccess Channel with Multiple Antennas

Optimal Dynamic Resource Allocation for Multi%2DAntenna Broadcasting with Heterogeneous Delay%2DConstrained Traffic

On Peak versus Average Interference Power Constraints for Spectrum Sharing in Cognitive Radio Networks

On Ergodic Sum Capacity of Fading Cognitive Multiple%2DAccess and Broadcast Channels

Optimal Beamforming for Two%2DWay Multi%2DAntenna Relay Channel with Analogue Network Coding

Optimal Power Allocation for Fading Channels in Cognitive Radio Networks Ergodic Capacity and Outage Capacity

Exploiting New Forms of Multiuser Diversity for Spectrum Sharing in Cognitive Radio Networks


Cognitive Beamforming Made Practical Effective Interference Channel and Learning%2DThroughput Tradeoff


Delay%2DThroughput Tradeoff for Supportive Two%2DTier Networks

Automatic Test Generation for Combinational Threshold Logic Networks.

Approaching MIMO%2DOFDM Capacity With Zero%2DForcing V%2DBLAST Decoding and Optimized Power

On the balance of multiuser diversity and spatial multiplexing gain in random beamforming.

The V%2A%2DDiagram a query%2Ddependent approach to moving KNN queries.
The moving k nearest neighbor (MkNN) query finds the k nearest neighbors of a moving query point continuously. The high potential of reducing the query processing cost as well as the large spectrum of associated applications have attracted considerable attention to this query type from the database community. This paper presents an incremental safe-region-based technique for answering MkNN queries, called the V*-Diagram. In general, a safe region is a set of points where the query point can move without changing the query answer. Traditional safe-region approaches compute a safe region based on the data objects but independent of the query location. Our approach exploits the current knowledge of the query point and the search space in addition to the data objects. As a result, the V*-Diagram has much smaller IO and computation costs than existing methods. The experimental results show that the V*-Diagram outperforms the best existing technique by two orders of magnitude.
Transaction time indexing with version compression.
Immortal DB is a transaction time database system designed to enable high performance for temporal applications. It is built into a commercial database engine, Microsoft SQL Server. This paper describes how we integrated a temporal indexing technique, the TSB-tree, into Immortal DB to serve as the core access method. The TSB-tree provides high performance access and update for both current and historical data. A main challenge was integrating TSB-tree functionality while preserving original B+tree functionality, including concurrency control and recovery. We discuss the overall architecture, including our unique treatment of index terms, and practical issues such as uncommitted data and log management. Performance is a primary concern. To increase performance, versions are locally delta compressed, exploiting the commonality between adjacent versions of the same record. This technique is also applied to index terms in index pages. There is a tradeoff between query performance and storage space. We discuss optimizing performance regarding this tradeoff throughout the paper. The result of our efforts is a high-performance transaction time database system built into an RDBMS engine, which has not been achieved before. We include a thorough experimental study and analysis that confirms the very good performance that it achieves.
Statistical performance critical path analysis for service%2Doriented systems.

Reboot%2Dbased self%2Dhealing strategies for service%2Doriented systems.

Visible Nearest Neighbor Queries.
Abstract. We introduce the visible k nearest neighbor (VkNN) query, which finds the k nearest objects that are visible to a query point. We also propose an algorithm to efficiently process the VkNN query. We compute the visible neighbors incrementally as we enlarge the search space. Our algorithm dramatically reduces the search cost compared to existing methods that require the computation of the visibility of all objects in advance. With extensive experiments, we show that our algorithm to process the VkNN query outperform the existing algorithms significantly.
Reputation%2Daware Transaction Mechanisms in Grid Resource Market.

A Capacity%2DApproaching Algorithm for Resource Allocation in MIMO%2DOFDM Multiple%2DAccess Channel.

A framework for interactive GPU%2Dsupported rendering and styling of virtual hair.

Identifying Performance%2DCritical Components in Transaction%2DOriented Distributed Systems.

Wavelet%2DBased Texture Retrieval using Independent Component Analysis.

A New Approach to Impulse Noise Removal for Color Image.

Modeling Autonomic Recovery in Web Services with Multi%2Dtier Reboots.

Autonomic Performance Recuperation for Service%2Doriented Systems.

Efficient Statistical Performance Modeling for Autonomic

Scalable problem localization for distributed systems principles and practices.

Performance problem localization in self%2Dhealing

A Scalable and Energy Efficient Sink Location Service for Large%2Dscale Wireless Sensor Networks.

Exploiting Multi%2DAntennas for Opportunistic Spectrum Sharing in Cognitive Radio Networks

Approaching MIMO%2DOFDM Capacity with Per%2DAntenna Power and Rate Feedback.
Abstract — This paper presents power-efficient transmission schemes for the multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) block-fading channel under the assumption that the channel during each fading block is known perfectly at the receiver, but is unavailable at the transmitter. Based on the well-known vertical Bell Labs layered space-time (V-BLAST) architecture that employs independent encoding for each transmit antenna and successive decoding at the receiver, this paper presents a per-antenna-based power and rate feedback scheme, termed the “closed-loop ” V-BLAST, for which the receiver jointly optimizes the power and rate assignments for all transmit antennas, and then returns them to the transmitter via a low-rate feedback channel. The power and rate optimization minimizes the total transmit power for support of an aggregate transmission rate during each fading block. Convex optimization techniques are used to design efficient algorithms for optimal power and rate allocation. The proposed algorithms are also modified to incorporate practical system constraints on feedback complexity and on modulation and coding. Furthermore, this paper shows that the per-antenna-based power and rate control can be readily modified to combine with the conventional linear MIMO transmit precoding technique as an efficient and capacity-approaching partial-channel-feedback scheme. Simulation results show that the closed-loop V-BLAST is able to approach closely the MIMO-OFDM channel capacity assuming availability of perfect channel knowledge at both the transmitter and the receiver. Index Terms — Orthogonal frequency-division multiplexing (OFDM), multiple-input multiple-output (MIMO), adaptive modulation and coding (AMC), power control, partial channel feedback, linear precoding, convex optimization. I.
Majority and Minority Network Synthesis With Application to QCA%2D

Threshold%2Fmajority logic synthesis and concurrent error detection targeting nanoelectronic implementations.

Fuzzy Support Vector Machines Regression for Business Forecasting An Application.

Approaching MIMO%2DOFDM Capacity with Closed%2DLoop V%2DBLAST.

Optimized Transmission for Upstream Vectored DSL Systems Using Zero%2DForcing Generalized Decision%2DFeedback Equalizers.

Dielectric Elastomer Spring Roll Actuators for a Portable Force Feedback Device.

Lookahead Cascade for Table Access on Small Devices.

Performance modeling and prediction for scientific Java applications.

A grid%2Dbased sink location service for large%2Dscale wireless sensor networks.

The Anchor Location Service %28ALS%29 protocol for large%2Dscale wireless sensor networks.

Random Beamforming with Systematic Beam Selection.

Multiple SVMs Enabled Sales Forecasting Support System.

State Encoding of Finite%2DState Machines Targeting Threshold and Majority Logic Based Implementations with Application to Nanotechnologies.

Optimized Transmission for Fading Multiple%2DAccess and Broadcast Channels With Multiple Antennas.


Subchannel grouping and statistical waterfilling for vector block%2Dfading channels.

Combining Wavelet Analysis and Bayesian Networks for the Classification of Auditory Brainstem Response.


MeRNA a database of metal ion binding sites in RNA structures.
Metal ions are essential for the folding of RNA into stable tertiary structures and for the catalytic activity of some RNA enzymes. To aid in the study of the roles of metal ions in RNA structural biology, we have created MeRNA (Metals in RNA), a comprehensive compilation of all metal binding sites identified in RNA 3D structures available from the PDB and Nucleic Acid Database. Currently, our database contains information relating to binding of 9764 metal ions corresponding to 23 distinct elements, in 256 RNA structures. The metal ion locations were confirmed and ligands characterized using original literature references. MeRNA includes eight manually identified metal-ion binding motifs, which are described in the literature. MeRNA is searchable by PDB identifier, metal ion, method of structure determination, resolution and R-values for X-ray structure and distance from metal to any RNA atom or to water. New structures with their respective binding motifs will be added to the database as they become available. The MeRNA database will further our understanding of the roles of metal ions in RNA folding and catalysis and have applications in structural and functional analysis, RNA design and engineering. The MeRNA database is accessible at
Classification of the Auditory Brainstem Response %28ABR%29 Using Wavelet Analysis and Bayesian Network.

OGSA%2Dbased grid workload monitoring.
In heterogeneous and dynamic distributed systems like the Grid, detailed monitoring of workload and its resulting system performance (e.g. response time) is required to facilitate performance diagnosis and adaptive performance tuning. In this paper, we present a workload monitoring infrastructure for this purpose. The infrastructure classifies and monitors workload across components in Grids based on the Open Grid Service Architecture (OGSA) in an end-to-end manner. It provides the abilities to assess what components are involved in processing a work unit, to report time elapsed at these components, and to capture concurrency and isolate which components are critical to overall performance observed. These are enclosed in an automatically constructed Response Time Service Petri Net (RT-SPN) model. A tool is provided to accept queries about work units and visualise corresponding RTSPNs. The infrastructure is also designed and implemented so as to be portable, scalable and lightweight. 1.
Adaptive Sampling for Monte Carlo Global Illumination Using Tsallis Entropy.

MEMS Accelerometer With Two Thin Film Piezoelectric Read%2DOut.

Efficient Human Body Configuration using MCMC.

Using cascade method for table access on small devices.

Comparing table views for small devices.

Synthesis of Majority and Minority Networks and Its Applications to QCA

Threshold network synthesis and optimization and its application to nanotechnologies.
Abstract — We propose an algorithm for efficient threshold network synthesis of arbitrary multi-output Boolean functions. Many nanotechnologies, such as resonant tunneling diodes (RTDs), quantum cellular automata (QCA), and single electron tunneling (SET), are capable of implementing threshold logic efficiently. The main purpose of this work is to bridge the current wide gap between research on nanoscale devices and research on synthesis methodologies for generating optimized networks utilizing these devices. While functionally-correct threshold gates and circuits based on nanotechnologies have been successfully demonstrated, there exists no methodology or design automation tool for general multi-level threshold network synthesis. We have built the first such tool, ThrEshold Logic Synthesizer (TELS), on top of an existing Boolean logic synthesis tool. Experiments with 56 multioutput benchmarks indicate that, compared to traditional logic synthesis, upto 80.0 % and 70.6 % reduction in gate count and interconnect count, respectively, is possible with the average being 22.7 % and 12.6%, respectively. Furthermore, the synthesized networks are well-balanced structurally. The novelty of this work lies in the introduction of the first comprehensive synthesis methodology and tool for general multi-level threshold logic design. Index Terms — Design automation, logic synthesis, QCA, RTD, threshold networks.
Multiuser MIMO Systems with Random Transmit Beamforming.

Synthesis and Optimization of Threshold Logic Networks with Application to Nanotechnologies.
We propose an algorithm for efficient threshold network synthesis of arbitrary multi-output Boolean functions. The main purpose of this work is to bridge the wide gap that currently exists between research on the development of nanoscale devices and research on the development of synthesis methodologies to generate optimized networks utilizing these devices. Many nanotechnologies, such as resonant tunneling diodes (RTD) and quantum cellular automata (QCA), are capable of implementing threshold logic. While functionally correct threshold gates have been successfully demonstrated, there exists no methodology or design automation tool for general multi-level threshold network synthesis. We have built the first such tool, ThrEshold Logic Synthesizer (TELS), on top of an existing Boolean logic synthesis tool. Experiments with about 60 multi-output benchmarks were performed, though the results of only 10 of them are reported in this paper because of space restrictions. They indicate that up to 77% reduction in gate count is possible when utilizing threshold logic, with an average reduction being 52%, compared to traditional logic synthesis. Furthermore, the synthesized networks are well-balanced, and hence delay-optimized.
An Automatic Test Pattern Generation Framework for Combinational Threshold Logic Networks.

Feature Extraction and Classification of the Auditory Brainstem Response Using Wavelet Analysis.

Random beamforming for MIMO systems with multiuser diversity.

Statistical power allocation strategy for vector block%2Dfading channels.

Examining Table Variations on Small Screen Devices.

Power%2DEfficient Geographic Routing for MANETs.

Design of Optimal Quantizers for Distributed Source Coding.
We address the problem of designing optimal quantizers for distributed  source coding. The generality of our formulation includes both the symmetric  and asymmetric scenarios, together with a number of coding schemes, such as  the ideal coding achieving a rate equal to the joint conditional entropy of the  quantized sources given the side information. We show the optimality conditions  quantizers must satisfy, and generalize the Lloyd algorithm for its design.
Wyner%2DZiv Coding for Video Applications to Compression and Error Resilience.
In this paper we consider two separate applications of Wyner-Ziv coding of  motion video. The Wyner-Ziv Theorem on source coding with side information  available only at the decoder suggests that an asymmetric video codec, where indi-  vidual frames are encoded separately but decoded conditionally (given temporally  adjacent frames) could achieve efficiency comparable to current interframe video  compression systems. We report first results on a Wyner-Ziv coding scheme for  motion video that uses intraframe encoding, but interframe decoding. Secondly,  we apply Wyner-Ziv coding to the transmission of compressed video over an errorprone  channel. We use Wyner-Ziv Coding to generate a supplementary bitstream  which contains a coarsely quantized representation of the transmitted video signal.
PDA Access to Internet Content Focus on Forms.

Architecture to Support Dynamic Composition of Math Lesson Plans.

Novel actuators for haptic displays based on electroactive polymers.

Dynamic Composition of Math Lessons.

Advances in channel%2Dadaptive video streaming.
Despite the well-known challenges of variations in throughput, delay, and packet loss over the Internet, video streaming has experienced phenomenal growth, owing to the extensive research in video coding and transmission. In this paper, we review several recent advances for channel-adaptive video streaming that, we believe, will benefit the design of video streaming systems in the future. Employed in different components of the system, these techniques have the common objective of providing efficient, robust, scalable and low-latency streaming video. First, by allowing the client to control the rate at which it consumes data, adaptive media playout can be used to reduce receiver buffering and therefore average latency, and provide limited rate scalability. Secondly, rate-distortion optimized packet scheduling, a transport technique, provides a flexible framework to determine the best packet to send given the channel behaviors, the packets&#039; deadlines, their transmission histories, the distortion reduction associated with sending each packet, and the inter-packet dependencies. Thirdly, at the source encoder channel-adaptive packet dependency control can greatly improve the error-resilience of streaming video and reduce latency. Finally we address the specific additional challenges for wireless video streaming. We consider three architectures for wireless video and discuss the utility of the reviewed techniques for each architecture.
Drift management and adaptive bit rate allocation in scalable video coding.

Minimum Classification Error Training for Handwritten Character Recognition.

Routers with a single stage of buffering.
Most high performance routers today use combined input and output queueing (CIOQ). The CIOQ router is also frequently used as an abstract model for routers: at one extreme is input queueing, at the other extreme is output queueing, and in-between there is a continuum of performance as the speedup is increased from 1 to N (where N is the number of linecards). The model includes architectures in which a switch fabric is sandwiched between two stages of buffering. There is a rich and growing theory for CIOQ routers, including algorithms, throughput results and conditions under which delays can be guaranteed. But there is a broad class of architectures that are not captured by the CIOQ model, including routers with centralized shared memory, and load-balanced routers. In this paper we propose an abstract model called Single-Buffered (SB) routers that includes these architectures. We describe a method called Constraint Sets to analyze a number of SB router architectures. The model helped identify previously unstudied architectures, in particular the Distributed Shared Memory router. Although commercially deployed, its performance is not widely known. We find conditions under which it can emulate an ideal shared memory router, and believe it to be a promising architecture. Questions remain about its complexity, but we find that the memory bandwidth, and potentially the power consumption of the router is lower than for a CIOQ router.
Advances in channel%2Dadaptive video streaming.
Despite the well-known challenges of variations in throughput, delay, and packet loss over the Internet, video streaming has experienced phenomenal growth, owing to the extensive research in video coding and transmission. In this paper, we review several recent advances for channel-adaptive video streaming that, we believe, will benefit the design of video streaming systems in the future. Employed in different components of the system, these techniques have the common objective of providing efficient, robust, scalable and low-latency streaming video. First, by allowing the client to control the rate at which it consumes data, adaptive media playout can be used to reduce receiver buffering and therefore average latency, and provide limited rate scalability. Secondly, rate-distortion optimized packet scheduling, a transport technique, provides a flexible framework to determine the best packet to send given the channel behaviors, the packets&#039; deadlines, their transmission histories, the distortion reduction associated with sending each packet, and the inter-packet dependencies. Thirdly, at the source encoder channel-adaptive packet dependency control can greatly improve the error-resilience of streaming video and reduce latency. Finally we address the specific additional challenges for wireless video streaming. We consider three architectures for wireless video and discuss the utility of the reviewed techniques for each architecture.
Offline Handwritten Character Recognition Based on Discriminative Training of Orthogonal Gaussian Mixture Model.

Offline handwritten numeral recognition using orthogonal Gaussian mixture model.

Prescient mode selection for robust video coding.
In standard predictive video coders, intra-mode coding of macroblocks (MBs) provides packet loss resilience, at the cost of reduced compression efficiency. Conventional mode selection algorithms are “greedy ” as they focus on minimization of distortion of current MB, while ignoring the effect of this selection on subsequent frames. This paper proposes an algorithm for prescient mode selection: the coding modes of MBs are chosen while taking into account the distortion of subsequent frames. The problem is formulated as one of joint selection of MB coding modes, for a group of pictures, so as to minimize the rate-distortion cost. The straightforward solution based on dynamic programming requires enormous computational complexity. We propose an iterative algorithm which obtains a locally optimal solution at feasible complexity. The total decoder distortion is computed using recursive optimal per-pixel estimate (ROPE) which accurately accounts for the effects of quantization, packet loss, error propagation, and error concealment. Simulation results show consistent improvement over our previous “greedy ” ROPE-RD mode selection, and substantial gains over other (non-ROPE) mode selection schemes. 1.
Location and interpretation of destination addresses on handwritten Chinese envelopes.

Robust Video Coding for Packet Networks with Feedback.

Switched Error Concealment and Robust Coding Decisions in Scalable Video Coding.

Offline Handwritten Chinese Character Recognition Using Optimal Sampling Features.


The Integration of Speech and Camera Control in Message Transfer TV Conferencing.


Show Actions in TV Conferencing.
This research studies the show actions to examine how participants integrate the threemodalities of speech,camera control, and gesture during TV conferencing. With introducing some concepts of individual show action, this paper focuses attention on the cooperative show actions of two person collaboration. A message exchange TV conferencing was simulated to make observation on participants&#039; free use of speech and camera controlmodality to transmit certain objects each other. The coordination and interaction of the two participants in modality choice were compared whenthey exchangethree typesof object,Formed Text, MathematicalExpressionandElectronicCircuit,with various sizes (complexity). Four models and nine types of the cooperative show actions were defined by how participants expressed an object and what modality they chose for the expression. The results of experiment confirmed that participants&#039; show actions were varying depending on the type and size of objects.  1: Introduction  T...
Remote and Local Camera Works in Media Communication.

Recognition of Character Strings from Color Urban Map Imageson the Basis of Validation Mechanism.

